A cut-peak function method for global optimization
نویسندگان
چکیده
منابع مشابه
A Novel Filled Function Method for Global Optimization
This paper considers the unconstrained global optimization with the revised filled function methods. The minimization sequence could leave from a local minimizer to a better minimizer of the objective function through minimizing an auxiliary function constructed at the local minimizer. Some promising numerical results are also included.
متن کاملA New Quasi-Filled Function Method for Constrained Global Optimization
In this paper, a class of new auxiliary function with one parameter on constrained problem for escaping the current local minimizer of global optimization problem is proposed. Firstly, we give a definition of the quasifilled function for constrained problem and under some mild assumptions, we prove the proposed auxiliary function is a quasi-filled function. Then, a new algorithm is presented ac...
متن کاملA Radial Basis Function Method for Global Optimization
We introduce a method that aims to nd the global minimum of a continuous nonconvex function on a compact subset of IR d. It is assumed that function evaluations are expensive and that no additional information is available. Radial basis function interpolation is used to deene a utility function. The maximizer of this function is the next point where the objective function is evaluated. We show ...
متن کاملA filled function method for constrained global optimization
In this paper, a Þlled function for escaping the current local minimizer of a constrained global optimization problem is proposed. Then a Þlled function method for obtaining a global minimizer of the constrained optimization problem is presented. By this method, a global minimizer of a constrained global optimization problem can be obtained just by searching local minimizers of the original con...
متن کاملPseudo-Cut Strategies for Global Optimization
Motivated by the successful use of a pseudo-cut strategy within the setting of constrained nonlinear and nonconvex optimization in Lasdon et al. (2010), we propose a framework for general pseudo-cut strategies in global optimization that provides a broader and more comprehensive range of methods. The fundamental idea is to introduce linear cutting planes that provide temporary, possibly invalid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2009
ISSN: 0377-0427
DOI: 10.1016/j.cam.2008.10.069